We present a volume rendering algorithm which renders images at approximately two to seven times the speed of a conventional ray caster with almost no visible loss of image quality. This algorithm traverses the volume data in object order and renders the image by performing ray casting for the pixels within the footprint of the voxel (i.e., rectangular prism) being processed. The proposed algorithm supports the rendering of both single and multiple isosurfaces with arbitrary opacity values. While the projection approach to volume rendering is not new, we present an algorithm specifically designed for the perspective projection, evaluate its rendering speed for both single and multiple isosurfaces with arbitrary opacity values, and examine how efficiently it uses cache memory.

An electron-wave device consisting of a hot electron transistor structure with a transversal potential grating in a base region is proposed. A reduced transit time and extremely small charging times provide significant potential for high-speed operation.

We propose an asymmetric fragile watermarking technique that uses a number theoretic transform (NTT). Signature data is extracted from a watermarked image by determining correlation functions that are computed using the NTT. The effectiveness of the proposed method is evaluated by simulated detection of altering.

The use of the Constructive Solid Geometry (CSG) model has been considered in several computer-aided design systems for recent years, since its concept of powerful and multiple operations on basic object shapes to create more complex ones is intuitively easy to understand. Based on the CSG concept and a guiding principle of scene analysis, an algorithm for interpreting three-view drawings is described in this paper. In a certain process, the 3D interpretation works on local recognition to detect possible subparts of which orthographic patterns are defined in the 2D description of a part. In the subsequent process, which examines all possible solutions to the given drawing until finding one that meets some goal criteria, the combinatorial operators are applied to the possible subparts. Through those repeated processes, the final solution can be obtained in terms of consistent subparts in a CSG tree, including additional information about solids and cavities.

A Josephson parametric oscillator (JPO) is an interesting system from the viewpoint of quantum optics because it has two stable self-oscillating states and can deterministically generate quantum cat states. A theoretical proposal has been made to operate a network of multiple JPOs as a quantum annealer, which can solve adiabatically combinatorial optimization problems at high speed. Proof-of-concept experiments have been actively conducted for application to quantum computations. This article provides a review of the mechanism of JPOs and their application as a quantum annealer.